Code generator and device for the synchronous or asynchronous and permanent identification or encoding and decoding of data of any particular length

ABSTRACT

A Code generator with a plurality of storage elements (FF 1,2, . . . n ) such as flip flops are connected to form a code-producing series (R), wherein the output of the final storage element (FF 5 ) in the series (R) in connected to the input of the first storage element (FF 1 ) in the series (R) to form a circuit and outputs and inputs of the storage elements are recursively connected means of EXOR gates. The first input ( 1 ) of at least one EXOR gate (EXOR p1 ) is connected to the output of a storage element (FF 1 ) disposed in the code-producing series (R), whose second input ( 2 ) thereof is connected to the output of another storage element (FF 3 ) disposed in the code-producing series (R), and the output ( 3 ) thereof is connected to the input of the storage element (FF 2 ) which succeeds the storage element (FF 1 ) connected with the first input ( 1 ) of the EXOR gate (EXOR p1 ). The output of a storage element (FF 5 ) disposed in the code-producing series (R) is connected to the input of an inverter (INV) and the output of the inverter (INV) is connected to the input of another storage element (FF 1 ) disposed in the series (R).

The invention relates to a code generator with a plurality of storage elements connected in a code-producing series, e.g., flip-flops, wherein the output of the last storage element in the series is linked with the input of the first storage element in the series to form a circuit, and outputs and inputs of the storage elements are recursively interconnected with EXOR gates inserted.

Such code generators are used for encrypting and decrypting information via communications networks. In principle, all encryption methods utilize a code, even if the information to be coded is itself used as code. The better the code used for encryption is hidden, the more effective the encryption. The longer the code, the more difficult it is to decrypt. For example, an infinite code never has to be hidden, since it is never completely known. Any code that does not repeat prior to the end of the information to be encrypted is functionally regarded as infinite. The advantage to a functionally infinite code is that the encryption and decryption process itself can be realized in a conceivably simple manner with a single EXOR or EXNOR operation. The disadvantage to a functionally infinite code is that it cannot be transmitted; it must be generated.

There is a simple way to generate a functionally infinite code by linking the two inputs of an EXOR gate with two outputs of series-connected storage elements, e.g., a shift register, and recursively interconnecting the output of the EXOR gate with the input of the shift register.

The result is a code sequence with a maximum length of L _(c)=2^(n)−1

-   -   (L_(c)=length of code sequence; n=number of code-generating,         series-connected storage elements)         bits.

The disadvantage to this code generator is that the structure of the generator can easily be inferred from the code sequence, so that it can be regenerated with an identically designed generator. The following patents represent attempts to further encrypt these code sequences with other processes, so that they can no longer be reconstructed: US 2001033663, WO 01/05090, WO 99/22484, WO 99/16208, JP10320181, WO98/02990 and EP 0782069. The code generators disclosed in these publications share in common that resonance effects shorten the length of the produced code. There also exist a number of pseudo-random-check generators, for example those described in JP 2000-101567, JP 2001-016197, EP 1999-0913964 or EP 1997-0782069. These code generators work with variables, wherein a mathematical, nonlinear conversion algorithm is used to calculate a code sequence from these variables. This is done to reduce the ability to recalculate using high and highest mathematical functions. These systems share in common that they use a mathematical functional unit that has a multi-bit input, adjacent to which is the output variable located in a code memory, and a one-bit output, from which the serial code sequence is read out, which has a negative effect on the maximum achievable code generating speed. Another object of high and heist mathematics is to find simple solutions to complex formulas, which is why the risk of discovering a simple solution to however complex a mathematical function can never be entirely precluded, and of course cannot be weighed.

The object of this invention is to provide a device for generating the most varied and long code sequences possible, wherein the goal is to get by with the least number of circuit elements possible. The code generator is to be suited for simultaneously encrypting high-frequency binary data streams over prolonged timeframes with the use of binary bit operations, wherein even the output code is to remain secret.

In order to achieve this object, this invention essentially proceeds from a code generator of the kind mentioned at the outset, wherein at least one EXOR gate is provided, whose first input is connected with the output of a storage element located in the code-producing series, whose second input is connected with the output of another storage element located in the code-producing series, and whose output is connected with the input of the storage element following the storage element connected with the first input of the EXOR gate in the code-producing series, and that the output of a storage element located in the code-producing series is connected with the input of an inverter, and the output of the inverter is connected with the input of another storage element arranged in the series. In this case, both the structure of the code generator and the algorithm running therein are known.

However, the structure is configured in such a way that it can generate a high enough number of different codes of sufficient length as to render highly improbable the discovery of the respectively used code along with the currently produced spot in the code sequence. The code cannot be regenerated if the generator can generate so many different codes that a segment of individual code cannot be used to infer its continuation. The generator generates the code sequence at the lowest possible level of bit operations. Variables are not used as the basis for calculating the code sequences, but rather only the states of individual storage elements, e.g., flip-flops or shift registers interconnected in a series. This yields the highest possible efficiency relative to the number of used switching elements on the one hand, and to the overall length of the generatable code sequences and number of generatable different codes. In addition, this ensures that the code generator can perform at the highest possible production rate.

According to the invention, the code sequence generated by the code generator is changed by inserting another EXOR gate between two storage elements located in the code-producing series, whose one input is connected to the output of a first storage element, while the second input is supplied by the output of some other storage element located in the series, and, finally, the input of the storage element connected to the first storage element in the conducting direction of the series is supplied with the output of the EXOR gate.

To generate a code proceeding from an empty storage element series that has a maximum length relative to the number of used storage elements, a single inverter must be present in the entire closed series of storage elements. The function of the inverter can of course be combined with the function of the EXOR gate in one switching element, e.g., by means of an EXNOR gate.

In order to now program different codes, the recursive function of the EXOR gate(s) is designed so that it can be enabled and disabled depending on internal code memory content. To this end, the invention is modified in such a way as to connect an AND gate in the line connecting the second input of the at least one EXOR gate and the output of the other storage element located in the code-reproducing series, so that the output of the AND gate is connected with the second input of the EXOR gate, the first input of the AND gate is connected with the output of the other storage element located in the code-producing series, and the second input of the AND gate is connected with the output of a storage element used for programming purposes.

The state of the respective storage element used for programming purposes hence determines whether the respective EXOR gate is enabled or disabled. As a consequence, such a storage element is referred to as a code-programming storage element.

To make the code more variable, a plurality of EXOR gates is preferably provided, whose first input is supplied by a respective output of one of the storage elements located in the code-producing series, and whose second input is supplied by the respective output of another storage element located in the code-producing series, which is spaced a number of storage elements in the conducting direction of the series away from the storage element respectively connected with the first input, which respectively corresponds to a different prime number that is greater than 1 and does not constitute a partial amount of the overall number of series-connected storage elements.

As a result, the resonance effects do not shorten the length of the produced code. In this case, a corresponding structure for the integration of varying code-changing EXOR gates ensures that no such partial sections of the storage element series that make up a percentage or multiple of another partial section or the entire section of the circuit exist between the two storage elements, which are situated in the code-producing series comprising a closed circuit and have the two inputs of the EXOR gates. The most effective way to realize this is to have the number of storage elements located in these partial sections and their overall number be prime numbers.

In a preferred further development of the invention, the internal code memory content is generated in such a way that not even the user knows the content of the internal code memory. This further complicates code decryption. To this end, the design preferably incorporates a plurality of code-programming storage elements that are respectively assigned to an AND gate and an EXOR gate and connected in a code-programming series comprising a closed circuit, and provides at least one EXOR gate, whose first input is connected with the output of a storage element located in the code-programming series, whose second input is connected with the output of another storage element located in the code-programming series, and whose output is connected with the input of the storage element following the storage element connected with the first input of the EXOR gate in the code-programming series. The states of the code-changing EXOR gates are hence programmed with the AND gates from a separate storage element series, which is recursively interconnected using at least one EXOR gate, in the same way as happens in the code-producing storage element series. In this case, programming takes place by providing the code-programming storage element series with a program clock, wherein a plurality of code generators can easily be programmed to an identical code, if, as described in a preferred embodiment, the code generator has at least one connection for at least a second, identically structured code generator, so that both code generators can be supplied with the same program clock at the same time.

The invention further relates to a device for sending and receiving encrypted information with at least two code generators, wherein the code generators each have a connection for simultaneously supplying the code-programming storage elements of all interconnected code generators with the same program clock, so that the code-programming storage elements of all interconnected code generators simultaneously run through all possible state combinations, and are provided with the same programming when the code generators are simultaneously separated from the program clock.

In a preferred further development according to subclaims 5, 6 and 9, the various code-programming EXOR gates are again enabled and disabled in terms of their program-influencing action by a programming storage element series comprised of additional storage elements, so that not all possible programming states need to be run through while programming, as a result of which the state of the code after programmed cannot be inferred even by approximation from the programming time duration.

The invention will be explained in greater detail below based on exemplary embodiments shown on the drawing. Shown on FIG. 1 is a principal circuit diagram for programmable recursive code generation, FIG. 2 is a general example of a circuit for a code-generator based functional unit, with which an encrypted connection can be established between two computers, and FIG. 3 is a general example of a circuit for a modified code generator.

FIG. 1 shows a principal circuit diagram in which five storage elements, i.e., the flip-flops FF_(1,2,3,4,5) coupled into a code-producing series R, an EXOR gate EXOR_(p1), an AND gate AND_(p1) and an inverter INV are interconnected, specifically in such a way as to connect in series, i.e., recursively, the input 2 of the EXOR gate EXOR_(p1) with the output 4 of the AND gate AND_(p1), its one input 5 with an output of one of the storage elements FF_(p1) used for programming purposes, and its other input 6 with the output of the storage element FF₃ located in the code-producing series, and its other input 1 of the EXOR gate EXOR_(p1) with the output of the storage element FF₁ located in the code-producing series R, and the output 3 of the EXOR gate EXOR_(p1) with the input of the storage element FF₂, and the output of the storage element FF₅ with the inputs of the inverter INV, and the output of the INV in turn with the input of the next storage element FF₁ in the conducting direction. A code sequence is generated with this circuit, proceeding from a series R of completely empty storage elements FF_(1,2,3,4,5). At least three clocks pass before the code repeats. The individual switching elements can be realized with commercially available modules. For example, a type 74HC174 IC can be used for the series-connected storage elements FF_(1,2,3,4,5), as can an IC 74HC08 for the AND gate AND_(p1), an IC 74HC386 for the EXOR gate EXOR_(p1), an IC 74HC00 for the inverter INV, and an IC 74HC107 for memory module FF_(p1).

The series shown on FIG. 1 can of course be lengthened, e.g., yielding a lengthened series R as shown on FIG. 2.

In this case, a number of continuous, series-connected storage elements can also be realized in the form of shift registers SRG₁, SRG₂, . . . The length of the code doubles per added storage element, so that the code length is calculated as follows: L _(c)=2^(n)−1

-   -   (L_(c)=length of code sequence; n=number of code-generating,         series-connected storage elements)

If this unit is operated with a specific clock, the following holds true for the duration of the code: $T_{c} = \frac{2^{n} - 1}{f_{c}}$

-   -   (T_(c)=time elapsed until code repeats; f_(c)=code generation         clock frequency)

At less than 50 storage elements at a code generating clock frequency of 384,000 bits/sec, the code runs longer than one year without the sequence repeating, so that a signal to be encrypted can simultaneously be sent over a dedicated line encrypted for just as long a time, and decrypted to enable live transmission for just as long a time.

If, assuming a corresponding length of the storage element series R, an EXOR gate EXOR_(p1,p2,p3,p4) is inserted between a storage element FF_(1,2,3,4) and the next storage element FF_(2,3,4,5) in the series R at several points in this storage element series, and then supplied with a signal from a third storage element FF_(8,15,20,23), the respective code generated as a result is changed (FIG. 2).

Given a plurality of code-changing EXOR gates EXOR_(p1,p2,p3,p4) (see FIG. 2), the object is to ensure that the various code-changing EXOR gates EXOR_(p1,p2,p3,p4), whose first input is supplied from an output of a storage element FF_(1,2,3,4), get their second input supplied from the respective output of a storage element FF_(8,15,20,23), which is spaced a number of storage elements in the conducting direction away from the initially mentioned storage element FF_(1,2,3,4), wherein the number each corresponds to a different prime number that is greater than 1, but not a partial amount of the total number of storage elements connected in series R, so that no code sequence-shortening resonance effects come about while influencing the code sequence. Therefore, a respective number of 7, 13, 17 and 19 (prime numbers) of storage elements lie between the corresponding storage element pairs FF_(1,8); FF_(2,15); FF_(3,20); FF_(4,23).

Connecting the output 4 of an AND gate AND_(p1) or AND_(p1,p2,p3,p4) whose one input 6 is suspended at the output of the storage element FF₃ or FF_(8,15,20,23) to one of the two inputs 2 of the respective EXOR gate EXOR_(p1) or EXOR_(p1,p2,p3,p4) makes it possible to enable or disable this EXOR gate EXOR_(p1) or EXPOR_(p1,p2,p3,p4) in terms of its code-changing action via the second input 5 of the AND gate AND_(p1) or AND_(p1,p2,p3,p4), and connecting another respective storage element FF_(p1) or FF_(p1,p2,p3,p4) thereto makes it possible to program the enabling and disabling of code-influencing action of the EXOR gate EXOR_(p1) or EXOR_(p1,p2,p3,p4) (FIG. 1 or FIG. 2). The code-programming storage elements FF_(p1,p2,p3,p4) can here be interconnected in a series RR. The code-programming storage elements FF_(p1,p2,p3,p4) can subsequently be in turn recursively interconnected with the help of an EXOR gate EXOR_(pp1).

The number of programmable different codes is calculated as follows: L _(c)=2^(pn)−1

-   -   (L_(c)=number of possible different codes; p_(n)=number of         programmable EXOR gates EXOR_(p1,p2, . . . pn))

If an identical code generator is now available, and the goal is to ascertain the further progression of the code sequence based on a specific number of bits, the probability that the correct continuation of the code sequence will be recognized depends both on the number of storage elements FF_(1,2, . . . n) used for generating the code, and on the number of programmable, code-changing EXOR gates EXOR_(p1,p2, . . . pn). This yields the following probability of discovering the programming underlying the code, and hence of predicting the further progression of the code: $W = \frac{N_{b}}{\left( {2^{n} - 1} \right) \cdot \left( {2^{pn} - 1} \right)}$

-   -   (N_(b)=number of observed code sequence bits; n=number of         code-generating, series-connected storage elements         FF_(1,2, . . . n); p_(n)=number of programmable, code-changing         EXOR gates EXOR_(p1,p2, . . . pn))

233 is the 52^(nd) prime number. If the 1 is not used and 233 expresses the total number of series-connected storage elements, there are 50 different storage elements along this segment, which each are spaced a distance away from the output storage element equal to a prime number (n_(p)=233+50=283).

As a consequence: $W = {\frac{N_{b}}{\left( {2^{n} - 1} \right) \cdot \left( {2^{pn} - 1} \right)} = \frac{N_{b}}{\left( {2^{283} - 1} \right) \cdot \left( {2^{50} - 1} \right)}}$ $W = \frac{N_{b}}{\left( {{1,{5541351138 \cdot 10^{85}}} - 1} \right) \cdot \left( {{1,{1258999068 \cdot 10^{15}}} - 1} \right)}$ $W = \frac{N_{b}}{1,{7498005798 \cdot 10^{100}}}$

In other words, the code sequence must be observed for 1.7498005798*10¹⁰⁰ clock increments for the probability of detecting a specific sequence to equal 1. At a clock frequency of 384000 Hz, this yields a necessary observation period of 1.4449430312*10 ⁸⁷ years.

Recursively interconnecting the code-programming storage elements (FF_(p1,p2,p3,p4,p5,p6)) so that they run through all possible state combinations within the time interval ${Tpn} = \frac{2^{pn} - 1}{f_{p}}$

-   -   (T pn=run time for all possible programming states; pn=number of         program storage elements; f_(p)=programming clock frequency)         yields the programming from a specific time range, in which the         code-programming storage elements are supplied with a program         clock, so that simultaneously activating and deactivating the         program clock at two identical code generators (activation pulse         and deactivation pulse at pin12 of IC 10 a in circuit on FIG. 2)         makes it possible to execute it in such a way that several code         generators generate identical code sequences, but the         programming content is not known, even to the programmers.

Programming can take place in two stages to prevent the programming from being even approximately gleaned from the programming duration. To this end, another programming level can be added by connecting the code-programming EXOR gate EXOR_(pp1) itself with a storage element series RRR, again inserting an AND gate AND_(pp1), hence making it programmable, wherein an EXOR gate EXOR_(ppp1) is again used for recursively interconnecting the series RRR (FIG. 3).

In the first programming stage, the programmer is programmed not to search for a segment of the possible programming states, which then represents the starting point for subsequent programming at which all points in such a segment can be looked up.

Proceeding from the above computing example, this ensures that the (2²⁸³−1)*(2⁵⁰−1) different states are divided into 2⁵⁰−1 different segments, of which one is selected in the first programming phase. This selection process takes place in a maximum of 2^(ppn)−1 steps (ppn=number of prime numbers contained in the number of prime numbers (50) used in programming, thus 16). This means that a maximum of 2^(16 steps must take place before all segments are searched. At a programming clock frequency of) 1 MHz, this process is completed in 0.065 seconds. A time surely covered in any programming process, since it lies under the reaction time of humans, thereby ensuring that no inferences to the key programming can be derived from the actually transpired programming period.

Two related, but dissimilar codes can be derived from one by assigning one of two sister codes only to every second state of a mother code.

The output signal is coded via an EXNOR gate (IC 17 b, c, FIG. 2), whose one input incorporates the signal to be encrypted, and whose second input incorporates the code, so that the code-encrypted output signal appears at its output.

The input signal is decoded via an EXNOR gate, whose one input incorporates the signal to be decrypted, and whose second input incorporates the code, so that the code-decrypted output signal appears at its output.

Using at least two such identically programmed code generators makes it possible to identify a second owner of the same code generator, and subsequently synchronize the code generators to establish a stable, encrypted data transmission circuit with this party over which live data can be permanently exchanged.

Since the circuit does not take up any CPU time during code generation itself, it is independent of any handshake time, and hence limited in its code production rate solely by the specific switching times of the electronic components comprising it. In this way, commercially available TTL components can be used to easily realize code production rates in the megahertz range.

In the following section, the inner operational sequence of the circuit according to FIG. 2 will be described step-by-step, wherein the term “key” is used for the functional unit according to the circuit on FIG. 2: Inner operational sequence of circuit ACTION REACTION FUNCTION 1.) The computer and key The respective contact inputs are Code production is set in keys A output of key A is connected to set to LOW in both keys A and B and B. the key input of key B Key A is operated by its own clock. The clock is transmitted from key A to key B. 2.) The lock key (lock OFF/lock The lock OFF signal is relayed All shift registers in both keys are ON) of key B is actuated for the from key A to key B. cleared first time A CLR signal is derived in both keys 3.) The clock is supplied to the Programming is concurrent and programming section from both synchronous in both keys, but keys A and B without any direct transmission of program content from key A to key B 4.) The lock key of key A is The clock is no longer supplied Synchronous programming stop actuated again to the programming section from both keys A and B 5.) The two keys are separated The respective contact inputs are Code production can now be set to HIGH in both keys A and B synchronously started in both keys A and B.

The section below describes the step-by-step operational sequence for establishing an encrypted connection between two computers with two functional units according to the circuit on FIG. 2: Overview of possible operational sequences Synchronization Synchronous MODE Identification mode mode mode CODE X X X ADDRESS X X TIME X Identify X Synchronize X X Decode X X X

(A) (B) PHASE ACTIONS KEY (A) KEY (B) Identification mode −x −x Programming Computer/key Key (A) is Key (B) is output of key (A) programmed, is programmed, is is connected with assigned code C1 as assigned code C2 as key input of key send code and code send code and code (B) C2 as receive code C1 as receive code 0 0 Separation Key (A) is Key (A) is mute Key (B) is mute removed from key (B) 0 0 Key Key (A) is connected activation with a computer (A) 0 0 An e-mail is written on the computer of key (A) 0+ 0 Code The e-mail is coded 1000+ packet call (live) with C1, wherein E-mail (A, 1000+ a sequence of 1000 e-mail) empty code bits including code generation time is appended in front of the e-mail uncoded 0+ 0 Data The e-mail is sent to 1000+ transfer the homepage on the E-mail computer of key (A) and displayed there 0+ 0 Key Key (B) is connected 1000+ activation with a computer E-mail (B) 0+ 0+ Code A 1000 bit sequence of 1000+ 1000 packet call code C1 is read out of E-mail (B, 1000) key (B) and transferred to a search engine 0+ 0+ If the homepage of key 1000+ 1000 (A) is detected, the e- E-mail mail is called 0+ 0+ Code Key (B) 1000+ 1000+ packet call (asynchronously) E-mail E-mail (B, e-mail) decodes the signal of key (A) via C1 0+ A Free- Key (B) now 1000+ flowing continuously generates E-mail code (B) code 0+ A Key (B) now knows 1000+ where to find key (A), E-mail and can establish a connection with it for purposes of synchronization Synchronization mode B 0 The e-mail is called from the server of key (B) C 0+ Code Key (B) compares the 1000 packet call 1000 bit sequence from (B, 1000) key (A) with its C1, and shifts it until synchronicity exists (discernible from the empty 1000 bit); (synchronously) decodes the signal from key (A) via C1; result: empty D 0+ Code Key (B) decodes 1000+ packet call (synchronizes) the E-mail (B, e-mail) content in the message from (A) via C1 E E Free- Key (B) now knows flowing where key (A) is on the code (A, B) time axis, so that it can now send code synchronously with it, and as such switch in the synchronous mode E+ E+ Key (A) decodes the Key (B) decodes the 1000 1000 signal of key (B) (live) signal of key (A) (live) via C2; result: empty via C1; result: empty F+ F+ Data A content is Key (A) codes the Key (B) decodes the message message transfer supplied to key message content message content of (A) duration duration (A) (live) via C1 (live) via C1 G+ G+ A content is Key (A) decodes the Key (B) codes the message message supplied to key message content of message content (live) duration duration (B) key (B) (live) via C2 via C2 

1. Code generator with a plurality of storage elements (FF_(1,2, . . . n)) connected in a code-producing series (R), e.g., flip-flops, wherein the output of the last storage element (FF₅) in the series (R) is linked with the input of the first storage element (FF₁) in the series (R) to form a circuit, and outputs and inputs of the storage elements are recursively interconnected with EXOR gates inserted, characterized in that at least one EXOR gate (EXOR_(p1)) is provided, whose first input (1) is connected with the output of a storage element (FF₁) located in the code-producing series (R), whose second input (2) is connected with the output of another storage element (FF₃) located in the code-producing series (R), and whose output (3) is connected with the input of the storage element (FF₂) following the storage element (FF₁) connected with the first input (1) of the EXOR gate (EXOR_(p1)) in the code-producing series (R), and that the output of a storage element (FF₅) located in the code-producing series (R) is connected with the input of an inverter (INV), and the output of the inverter (INV) is connected with the input of another storage element (FF₁) arranged in the code-producing series (R).
 2. Code generator according to claim 1, characterized in that an AND gate (AND_(p1)) is connected in the line connecting the second input (2) of the at least one EXOR gate (EXOR_(p1)) and the output of the other storage element (FF₃) located in the code-reproducing series (R), so that the output (4) of the AND gate (AND_(p1)) is connected with the second input (2) of the EXOR gate (EXOR_(p1)) the first input (6) of the AND gate (AND_(p1)) is connected with the output of the other storage element (FF₃) located in the code-producing series (R), and the second input (5) of the AND gate (AND_(p1)) is connected with the output of a code-programming storage element (FF_(p1)).
 3. Code generator according to claim 1, characterized in that a plurality of EXOR gates (EXOR_(p1,p2,p3,p4)) is provided, whose first input is supplied by a respective output of one of the storage elements (FF_(1,2,3,4)) located in the code-producing series (R), and whose second input is supplied by the respective output of another storage element (FF_(28,15,20,23)) located in the code producing series (R), which is spaced a number of storage elements in the conducting direction of the series (R) away from the storage element (FF_(1,2,3,4)) respectively connected with the first input, which respectively corresponds to a different prime number that is greater than 1 and does not constitute a partial amount of the overall number of storage elements (FF_(1,2, . . . n)) connected in series (R).
 4. Code generator according to claim 1, characterized in that a plurality of code-programming storage elements (FF_(p1,p2,p3,p4, . . . pn)) that are respectively assigned to an AND gate (AND_(p1,p2,p3,p4)) and an EXOR gate (EXOR_(p1,p2,p3,p4)) is provided and connected in a series (RR) comprising a closed circuit, and at least one EXOR gate (EXOR_(pp1)) is provided whose first input is connected with the output of a storage element (FF_(pp6)) located in the code-programming series (RR), whose second input is connected with the output of another storage element (FF_(p5)) located in the code-programming series (RR), and whose output is connected with the input of the storage element (FF_(pp1)) following the storage element (FF_(pp5)) connected with the first input of the EXOR gate (EXOR_(pp1)) in the code-programming series (RR).
 5. Code generator according to claim 4, characterized in that an AND gate (AND_(pp1)) is connected in the line connecting the second input of the at least one EXOR gate (EXOR_(pp1)) and the output of the other storage element (FF_(p3)) located in the code-reproducing series (RR), so that the output of the AND gate (AND_(pp1)) is connected with the second input of the EXOR gate (EXOR_(pp1)), the first input of the AND gate (AND_(pp1)) is connected with the output of the other storage element (FF_(p3)) located in the code-producing series (RR), and the second input of the AND gate (AND_(pp1)) is connected with the output of a storage element (FF_(pp5)) used for programming the code-programming series (RR).
 6. Code generator according to claim 5, characterized in that a plurality of storage elements (FF_(pp1,pp2,pp3,pp4, . . . pn)) used to program the code programming series (RR) that are respectively assigned to an AND gate (AND_(pp1)) and an EXOR gate (EXOR_(pp1)) is provided and connected in a series (RRR) comprising a closed circuit, and at least one EXOR gate (EXOR_(ppp1)) is provided whose first input is connected with the output of a storage element (FF_(pp1)) located in the series (RRR), whose second input is connected with the output of another storage element (FF_(pp3)) located in the series (RRR), and whose output is connected with the input of the storage element (FF_(pp2)) following the storage element (FF_(pp1)) connected with the first input of the EXOR gate (EXOR_(ppp1)) in the series (RRR).
 7. Code generator according to claim 1, characterized in that it has at least one connection for at least a second, identically structured code generator, so that both code generators can be supplied with the same program clock at the same time.
 8. Device for sending and receiving encrypted information with at least two code generators according to claim 1, characterized in that the code generators each have at least one connection for simultaneously supplying the code-programming storage elements (FF_(p1,p2,p3,p4)) of all interconnected code generators with the same program clock, so that the code-programming storage elements (FF_(p1,p2 p3, . . . pn)) of all interconnected code generators simultaneously run through all possible state combinations, and are provided with the same programming when the code generators are simultaneously separated from the program clock.
 9. Device according to claim 8, characterized in that the code generators each have two connections for simultaneously supplying the code-programming storage elements (FF_(p1,p2,p3, . . . pn)) and the storage elements (FF_(pp1,pp2,pp3, . . . ppn)) used to program the code-programming storage elements (FF_(p1,p2,p3, . . . pn)) of all interconnected code generators have two independently running program clocks, wherein the storage elements (FF_(pp1,pp2,pp3, . . . ppn)) used to program the code-programming storage elements (FF_(p1,p2,p3, . . . pn)) run through all possible state combinations at least once, and the code-programming storage elements (FF_(p1,p2,p3, . . . pn)) of all interconnected code generators simultaneously run through a specific number of all possible state combinations, and that all interconnected code generators are provided with the same programming after the simultaneous separation of code generators from the program clocks. 